#include<vector>
#include<string>
using namespace std;
class Solution {
public:
    bool isMatch(string s, string p) {
        int m=s.size(),n=p.size();
        vector<vector<bool>>dp(m+1,vector<bool>(n+1));
        s="_"+s,p="_"+p;
        dp[0][0]=true;
        for(int j=1;j<=n;j++){
            if(p[j]!='*')break;
            dp[0][j]=true;
        }
        for(int i=1;i<=m;i++){
            for(int j=1;j<=n;j++){
                if(p[j]=='*')
                    dp[i][j]=dp[i-1][j]||dp[i][j-1];
                else
                    dp[i][j]=(p[j]=='?'||p[j]==s[i])&&dp[i-1][j-1];
            }
        }
        return dp[m][n];
    }
};